<TITLE>prob009: perfect square placement</TITLE>
<HR><!------------------------------------------------------------------------>
<CENTER>
<H1>prob009: perfect square placement</H1>

<TABLE>
<TR> <TD> proposed by
     <TD ALIGN=LEFT> <A HREF="http://www.cosytec.com">
          <B>Helmut Simonis</B></A>
          <ADDRESS><a href="mailto:simonis@cosytec.com">
          simonis@cosytec.com</a></ADDRESS>
</TABLE>
</CENTER>
<HR><!------------------------------------------------------------------------>
<H3> Specification </H3>

<TT>

The perfect square placement problem (also called the squared square problem) 
is to pack a set of squares with given integer sizes into a bigger 
square in such a way that no squares overlap each other and all square borders
are parallel to the border of the big square. For a perfect placement problem, all squares have different sizes. The sum of the square surfaces is equal to the 
surface of the packing square, so that there is no spare capacity. 
A simple perfect square placement problem is a perfect 
square placement problem in which no
subset of the squares (greater than one) are placed in a rectangle.


<P>

</TT>


<HR><!------------------------------------------------------------------------>

<UL>

 <A HREF="../../index.html"> Back</A> to CSPLib home page.


